Randomized rounding

Results: 58



#Item
21Matroid / Randomized rounding / Markov chain / Linear programming / Chernoff bound / Tutte polynomial / Sturm–Liouville theory / Mathematics / Matroid theory / Dimension

Concentration Inequalities for Nonlinear Matroid Intersection∗ Konstantin Makarychev Microsoft Research Warren Schudy IBM Research

Add to Reading List

Source URL: konstantin.makarychev.net

Language: English - Date: 2014-06-08 22:16:28
22Mathematical logic / Nothing / Vacuous truth / Veracity / Randomized rounding / Mathematics / Polynomials / Computational problems

Texas A&M University Department of Mathematics April 2, 2006 Dear Student, Do you think math is fun? Come join our Summer Educational Enrichment in Math (SEE Math) program this summer and "SEE" how much fun mathematics c

Add to Reading List

Source URL: see-math.math.tamu.edu

Language: English - Date: 2006-04-06 15:24:22
23Operations research / Submodular set function / Computational complexity theory / Linear programming / Randomized rounding / Continuous function / Optimization problem / Mathematical optimization / Time complexity / Theoretical computer science / Mathematics / Applied mathematics

informs MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxx–xxx ISSN 0364-765X | EISSN |xx|0000|0xxx

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2012-09-10 09:13:15
24Convex optimization / Linear programming / Conjunctive query / Algorithm / Randomized rounding / Exponential mechanism / Mathematics / Operations research / Applied mathematics

Worst-case Optimal Join Algorithms Hung Q. Ngo Ely Porat Christopher Ré

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 2012-03-21 08:53:44
25Matroid / Randomized rounding / Auxiliary function / Euclidean algorithm / Dominating set / Mathematics / Submodular set function / Matroid theory

A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint Yuval Filmus Department of Computer Science University of Toronto

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2012-08-16 03:01:30
26Combinatorial optimization / NP-complete problems / Spanning tree / Analysis of algorithms / Algorithms / Randomized rounding / Maximum flow problem / Shortest path problem / Steiner tree problem / Theoretical computer science / Mathematics / Computational complexity theory

A General Approach to Online Network Optimization Problems Noga Alon∗ Baruch Awerbuch† Yossi Azar‡

Add to Reading List

Source URL: www.cs.jhu.edu

Language: English - Date: 2007-10-09 11:14:47
27Analysis of algorithms / NP-complete problems / Probabilistic complexity theory / Randomized algorithm / Set cover problem / Competitive analysis / Algorithm / Randomized rounding / Euclidean algorithm / Mathematics / Theoretical computer science / Applied mathematics

The Online Set Cover Problem (Extended Abstract) Noga Alon∗ Baruch Awerbuch†

Add to Reading List

Source URL: www.cs.jhu.edu

Language: English - Date: 2007-10-09 11:17:36
28Probability / Randomized rounding / Method of conditional probabilities / Pi / Linear programming relaxation / Exponential distribution / Mathematics / Algorithms / Mathematical analysis

Deriving greedy algorithms and Lagrangian-relaxation algorithms Neal E. Young February 16, 2007

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2008-04-29 13:22:24
29Approximation algorithms / Submodular set function / Time complexity / Linear programming relaxation / Polynomial-time approximation scheme / Linear programming / Randomized rounding / Normal distribution / Linear regression / Theoretical computer science / Applied mathematics / Computational complexity theory

Budget Feasible Mechanisms for Experimental Design Thibaut Horel ´ Ecole Normale Sup´erieure

Add to Reading List

Source URL: thibaut.horel.org

Language: English - Date: 2015-01-22 00:44:30
30Poisson distribution / Normal distribution / Poisson process / Variance / Expected value / Simulated annealing / Secretary problem / Randomized rounding / Statistics / Probability and statistics / Probability theory

In D. Al–Dabass (Ed.), Proceedings of the 17th European Simulation Multiconference (pp. 105–110). Nottingham, UK, 2003. CONFLICT RESOLUTION BY RANDOM ESTIMATED COSTS ROMAN V BELAVKIN School of Computing Science, Midd

Add to Reading List

Source URL: www.eis.mdx.ac.uk

Language: English - Date: 2006-01-31 05:13:14
UPDATE